Centralized asynchronous broadcast in radio networks
نویسندگان
چکیده
منابع مشابه
Centralized asynchronous broadcast in radio networks
We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for...
متن کاملAsynchronous Broadcast in Radio Networks
We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node. The timing of arrivals of messages is controlled by adversaries. We consider three different adversaries. The edge adversary can have a transmitted message delivered at different times to different recipients. The crash adver...
متن کاملCentralized broadcast in multihop radio networks
We show that for any radio network there exists a schedule of a broadcast whose time is O(D+ log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D =Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the...
متن کاملCentralized broadcast scheduling in packet radio networks via genetic-fix algorithms
An important, yet difficult, problem in the design of a packet radio network is the determination of a conflict-free broadcast schedule at a minimum cycle length. In this letter, we first formulate the problem via a within-two-hop connectivity matrix and then, by assuming a known cycle length, determine a conflict-free scheduling pattern using a centralized approach that exploits the structure ...
متن کاملTime efficient centralized gossiping in radio networks
In this paper we study the gossiping problem (all-to-all communication) in radio networks where all nodes are aware of the network topology. We start our presentation with a deterministic gossiping algorithm that works in at most n units of time in any radio network of size n. This algorithm is optimal in the worst case scenario since there exist radio network topologies, such as lines, stars a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.03.057